An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles

In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph C_m $\cup$ P_m when m = 4, 6,8,10 and then we proved that the graph C_ $\cup$ P_n is odd graceful if m is even. Finally, we described an algorithm to label the vertices and the edges of the vertex set V(C_m $\cup$ P_n) and the edge set E(C_m $\cup$ P_n).Comment: 9 Pages, JGraph-Hoc Journa

Weak compactness of almost limited operators

The paper is devoted to the relationship between almost limited operators and weakly compacts operators. We show that if $F$ is a $\sigma$-Dedekind complete Banach lattice then, every almost limited operator $T:E\rightarrow F$ is weakly compact if and only if $E$ is reflexive or the norm of $F$ is order continuous. Also, we show that if $E$ is a $\sigma$-Dedekind complete Banach lattice then the square of every positive almost limited operator $T:E\rightarrow E$ is weakly compact if and only if the norm of $E$ is order continuous.Comment: 5 page

A 2-Dimensional Cellular Automaton for Agents Moving from Origins to Destinations

We develop a two-dimensional cellular automaton (CA) as a simple model for agents moving from origins to destinations. Each agent moves towards an empty neighbor site corresponding to the minimal distance to its destination. The stochasticity or noise ($p$) is introduced in the model dynamics, through the uncertainty in estimating the distance from the destination. The friction parameter $"\mu"$ is also introduced to control the probability that the movement of all agents involved to the same site (conflict) is denied at one time step. This model displays two states; namely the freely moving and the jamming state. If $\mu$ is large and $p$ is low, the system is in the jamming state even if the density is low. However, if $\mu$ is large and $p$ is high, a freely moving state takes place whenever the density is low. The cluster size and the travel time distributions in the two states are studied in detail. We find that only very small clusters are present in the freely moving state while the jamming state displays a bimodal distribution. At low densities, agents can take a very long time to reach their destinations if $\mu$ is large and $p$ is low (jamming state); but long travel times are suppressed if $p$ becomes large (freely moving state).Comment: 10 pages, 12 figure

Fostering Agricultural and Food System Transformation in Africa

Agricultural and Food Policy, Downloads July 2008 - June 2009: 8,

Monitoring Employee Behavior Through the Use of Technology and Issues of Employee Privacy in America

Despite the historic American love for privacy that has enhanced innovation and creativity throughout the country, encroachments on privacy restrain individual freedom. Noticeable, advances in technology have offered decision makers remarkable monitoring aptitudes that can be used in numerous tasks for multiple reasons. This has led scholars and practitioners to pose a significant number of questions about what is legitimate and illegitimate in the day-to-day affairs of a business. This article is composed of (a) research about electronic monitoring and privacy concerns; (b) definitions of, critiques of, and alternatives to electronic performance monitoring (EPM); (c) motives behind employee monitoring and leadership behaviors; (d) advice that makes monitoring less distressful; (e) employee monitoring policies; (f) reviewing policies and procedures; (g) the role of human resource development (HRD) in employee assessment and development; and (h) conclusion and recommendations for further studies